Specifying and Verifying Aspect-Oriented Systems in Rewriting Logic
نویسندگان
چکیده
Aspect-oriented (AO) systems have to deal with an important problem which is the management of aspect interaction. In this paper, we introduce a first tool, known as AO-Maude, which is based on Maude language for the specification and the verification of the AO systems. The proposed tool relies on the reflection feature of rewriting logic that allows us to represent in the Meta-Level the structure of the base system, aspects and the weaver mechanism. The contributions of this paper are twofold. First, we provide a support for the specification of the AO systems in Maude language and thus discharge the user from the task of the definition of the weaver mechanism each time. Second, our extension offers a support to the AO systems in Maude while managing the aspect interaction problem in general and the scheduling problem in particular. The proposed tool is illustrated with a concrete case study.
منابع مشابه
Certifying Confluence of Almost Orthogonal CTRSs via Exact Tree Automata Completion
Suzuki et al. showed that properly oriented, right-stable, orthogonal, and oriented conditional term rewrite systems with extra variables in right-hand sides are confluent. We present our Isabelle/HOL formalization of this result, including two generalizations. On the one hand, we relax proper orientedness and orthogonality to extended proper orientedness and almost orthogonality modulo infeasi...
متن کاملTheorem Proving for Maude’s Rewriting Logic Vlad Rusu and Manuel Clavel
We present an approach based on inductive theorem proving for verifying invariance properties of systems specified in Rewriting Logic, an executable specification language implemented (among others) in the Maude tool. Since theorem proving is not directly available for rewriting logic, we define an encoding of rewriting logic into its membership equational (sub)logic. Then, inductive theorem pr...
متن کاملSpecifying the ODP Information Viewpoint using Maude
Maude is an executable rewriting logic language specially well suited for the specification of object-oriented open and distributed systems. In this paper we explore the possibility of using Maude as a formal notation for writing and reasoning about RM-ODP information specifications.
متن کاملVerifying Reachability-Logic Properties on Rewriting-Logic Specifications
Reachability Logic is a recently introduced formalism, which is currently used for defining the operational semantics of programming languages and for stating properties about program executions. In this paper we show how Reachability Logic can be adapted for stating properties of transition systems described by Rewriting-Logic specifications. We propose an automatic procedure for verifying Rew...
متن کاملVerification of Evolving Graph Structures
This report documents the programme and the outcome of Dagstuhl Seminar 15451 “Verification of Evolving Graph Structures”. The aim was to bring together researchers from different communities (shape analysis, separation logic, graph transformation, verification of infinite-state systems) who are interested in developing techniques for the analysis of graph manipulations, i.e., methods that are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014